Conditional sum-product networks: Modular probabilistic circuits via gate functions
نویسندگان
چکیده
While probabilistic graphical models are a central tool for reasoning under uncertainty in AI, they general not as expressive deep neural models, and inference is notoriously hard slow. In contrast, such sum-product networks (SPNs) capture joint distributions ensure tractable inference, but still lack the power of intractable based on networks. this paper, we introduce conditional SPNs (CSPNs)—conditional density estimators multivariate potentially hybrid domains—and develop structure-learning approach that derives both structure parameters CSPNs from data. To harness (DNNs), also show how to realize by conditioning vanilla input using DNNs gate functions. contrast whose high-level can be explicitly manipulated, naturally used building blocks modular maintains interpretability. experiments, demonstrate competitive with other yield superior performance structured prediction, estimation, auto-regressive image modeling, multilabel classification. particular, employing encoders decoders within variational autoencoders help relax commonly mean field assumption turn improve performance.
منابع مشابه
Learning Graph-Structured Sum-Product Networks for Probabilistic Semantic Maps
We introduce Graph-Structured Sum-Product Networks (GraphSPNs), a probabilistic approach to structured prediction for problems where dependencies between latent variables are expressed in terms of arbitrary, dynamic graphs. While many approaches to structured prediction place strict constraints on the interactions between inferred variables, many real-world problems can be only characterized us...
متن کاملSum-Product-Quotient Networks
We present a novel tractable generative model that extends Sum-Product Networks (SPNs) and significantly boosts their power. We call it Sum-Product-Quotient Networks (SPQNs), whose core concept is to incorporate conditional distributions into the model by direct computation using quotient nodes, e.g. P (A|B)= (A,B) P (B) . We provide sufficient conditions for the tractability of SPQNs that gene...
متن کاملCredal Sum-Product Networks
Sum-product networks are a relatively new and increasingly popular class of (precise) probabilistic graphical models that allow for marginal inference with polynomial effort. As with other probabilistic models, sum-product networks are often learned from data and used to perform classification. Hence, their results are prone to be unreliable and overconfident. In this work, we develop credal su...
متن کاملDynamic Sum-Product Networks
Inference in dynamic graphical models is known to be hard, except for models with low treewidth structure. This restricts severely the expressive power of these kinds of models. In this document we are proposing a new type of dynamic graphical model that allows one to model complex stochastic processes with unbounded treewidth while guaranteeing tractable exact inferenc e. The proposed dynamic ...
متن کاملProbabilistic Conditional Preference Networks
This paper proposes a “probabilistic” extension of conditional preference networks as a way to compactly represent a probability distributions over preference orderings. It studies the probabilistic counterparts of the main reasoning tasks, namely dominance testing and optimisation from the algorithmical and complexity viewpoints. Efficient algorithms for tree-structured probabilistic CP-nets a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2022
ISSN: ['1873-4731', '0888-613X']
DOI: https://doi.org/10.1016/j.ijar.2021.10.011